tosscall

Q: The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.

/* Link list node */
struct node
{
    int data;
    struct node* next;
};
 
/* head_ref is a double pointer which points to head (or start) pointer 
  of linked list */
static void reverse(struct node** head_ref)
{
    struct node* prev   = NULL;
    struct node* current = *head_ref;
    struct node* next;
    while (current != NULL)
    {
        next  = current->next;  
        current->next = prev;   
        prev = current;
        current = next;
    }
    /*ADD A STATEMENT HERE*/
}
What should be added in place of “/*ADD A STATEMENT HERE*/”, so that the function correctly reverses a linked list.

A. *head_ref = prev;

B. *head_ref = current;

C. *head_ref = next;

D. *head_ref = NULL;

Solution:  *head_ref = prev; At the end of while loop, the prev pointer points to the last node of original linked list.
We need to change *head_ref so that the head pointer now starts pointing to the last node.

Q: What is the output of following function for start pointing to first node of following linked list?

1->2->3->4->5->6
void fun(struct node* start)
{
    if(start == NULL)
    return;
    printf("%d  ", start->data); 
    if(start->next != NULL )
    fun(start->next->next);
    printf("%d  ", start->data);
}

A. 1 4 6 6 4 1

B. 1 3 5 1 3 5

C. 1 2 3 5

D. 1 3 5 5 3 1

Solution: fun() prints alternate nodes of the given Linked List, first from head to end, and then from end to head.
If Linked List has even number of nodes, then skips the last node.

Q: The following C function takes a simply-linked list as an input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. Choose the correct alternative to replace the blank line.

typedef struct node 
{
    int value;
    struct node *next;
}Node;
 
Node *move_to_front(Node *head) 
{
    Node *p, *q;
    if ((head == NULL: || (head->next == NULL)) 
    return head;
    q = NULL; p = head;
    while (p-> next !=NULL) 
    {
        q = p;
        p = p->next;
    }
   _______________________________
  return head;
}

A. q = NULL; p->next = head; head = p;

B. q->next = NULL; head = p; p->next = head;

C. head = p; p->next = q; q->next = NULL;

D. q->next = NULL; p->next = head; head = p;

Solution: When while loop completes its execution, node ‘p’ refers to the last node whereas the ‘q’ node refers to the node before ‘p’ in the linked list. q->next=NULL makes q as the last node. p->next=head places p as the first node. the head must be modified to ‘p’ as ‘p’ is the starting node of the list (head=p). Thus the sequence of steps are q->next=NULL, p->next=head, head=p.

Q: The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution?

struct node 
{
    int value;
    struct node *next;
};
void rearrange(struct node *list)
{
    struct node *p, * q;
    int temp;
    if ((!list) || !list->next) 
      return;
    p = list;
    q = list->next;
    while(q) 
    {
         temp = p->value;
         p->value = q->value;
         q->value = temp;
         p = q->next;
         q = p?p->next:0;
    }
}

A. 1, 2, 3, 4, 5, 6, 7

B. 2, 1, 4, 3, 6, 5, 7

C. 1, 3, 2, 5, 4, 7, 6

D. 2, 3, 4, 5, 6, 7, 1

Solution: The function rearrange() exchanges data of every node with its next node. It starts exchanging data from the first node itself.

Q: In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?

A. log 2 n

B. n⁄2

C. log 2 n – 1

D. n

Solution: In the worst case, the element to be searched has to be compared with all elements of the linked list.

Q: Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

A. Possible if X is not last node

B. Possible if size of linked list is even

C. Possible if size of linked list is odd

D. Possible if X is not first node

Solution: Following are simple steps.
    struct node *temp  = X->next;
    X->data  = temp->data;
    X->next  = temp->next;
    free(temp);

Q: You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?

A. Delete the first element

B. Insert a new element as a first element

C. Delete the last element of the list

D. Add a new element at the end of the list

Solution: Deletion of the first element of the list is done in O (1) time by deleting memory and changing the first pointer.
Insertion of an element as a first element can be done in O (1) time. We will create a node that holds data and points to the head of the given linked list. The head pointer was changed to a newly created node.
Deletion of the last element requires a pointer to the previous node of last, which can only be obtained by traversing the list. This requires the length of the linked list.
Adding a new element at the end of the list can be done in O (1) by changing the pointer of the last node to the newly created node and last is changed to a newly created node.

Q: In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is?

A. log2 n

B. n⁄2

C. log2 n – 1

D. n

Solution: The worst-case happens if the required element is at last or the element is absent in the list. For this, we need to compare every element in the linked list. If n elements are there, n comparisons will happen in the worst case.

Test Series - Data Structure

Test Number 10/115